Concurrent Non-malleable Commitments from Any One-Way Function
نویسندگان
چکیده
We show the existence of concurrent non-malleable commitments based on the existence of one-way functions. Our proof of security only requires the use of black-box techniques, and additionally provides an arguably simplified proof of the existence of even stand-alone secure non-malleable commitments.
منابع مشابه
Concurrent Non-Malleable Commitments from One-way Functions
We show the existence of concurrent non-malleable commitments based on the existence one-way functions. Our proof of security only requires the use of black-box techniques, and additionally provides an arguably simplified proof of the existence of even stand-alone secure non-malleable commitments. Cornell University, E-Mail: [email protected] Cornell University, E-Mail: [email protected]...
متن کاملConcurrent Non-Malleable Commitments (and More) in 3 Rounds
The round complexity of commitment schemes secure against man-in-the-middle attacks has been the focus of extensive research for about 25 years. The recent breakthrough of Goyal, Pandey and Richelson [STOC 2016] showed that 3 rounds are sufficient for (one-left, one-right) non-malleable commitments. This result matches a lower bound of [Pas13]. The state of affairs leaves still open the intrigu...
متن کاملAn Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptived...
متن کاملBlack-Box Constructions of Two-Party Protocols from One-Way Functions
We exhibit constructions of the following two-party cryptographic protocols given only black-box access to a one-way function: – constant-round zero-knowledge arguments (of knowledge) for any language in NP; – constant-round trapdoor commitment schemes; – constant-round parallel coin-tossing. Previous constructions either require stronger computational assumptions (e.g. collision-resistant hash...
متن کاملConstant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, this is the first construction of a constant-round non-malleable protocol based on only one-wayness, or to admit a black-box proof of security under any standard-type assumption.
متن کامل